منابع مشابه
Simple Matrix Languages
It is shown that £t(1)[~(l)] coincides with the class of context-free languages [regular sets] and that ~9' is a proper subset of the family of languages accepted by deterministic linear bounded automata, It is proved that ~(n)[~(n)] forms a hierarchy of classes of languages in ~9°[~]. The closure properties and decision problems associated with ,9°(n), ,.9", ,~(n), and ~ are thoroughly investi...
متن کاملA Homomorphic Representation of Simple Matrix Languages
In this paper we continue the investigation of simple matrix languages introduced by Ibarra (1970) as a subfamily of matrix languages. Simple matrix languages have many properties similar to those of context-free languages. In the following, we prove that every simple matrix language can be written as a homomorphic image of the intersection of the Dyck context-free language and an equal matrix ...
متن کاملCodifiable Languages and the Parikh Matrix Mapping
We introduce a couple of families of codifiable languages and investigate properties of these families as well as interrelationships between different families. Also we develop an algorithm based on the Earley algorithm to compute the values of the inverse of the Parikh matrix mapping over a codifiable context-free language. Finally, an attributed grammar that computes the values of the Parikh ...
متن کاملChannel Capacity of Equal Matrix Languages
where f l , are in V~ Equal matrix languages (abbreviated E M L ) have the interesting property that the corresponding Parikh mappings are semilinear (Siromoney, 1969a, 1969b). Further, every equal matrix grammar (abbreviated E M G ) is nonterminal bounded in the sense that in any line of a derivation the total number of nonterminals is less than a constant. This concept of nonterminal boundedn...
متن کاملOn minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90917-0